Connection between conjunctive capacity and structural properties of graphs
نویسندگان
چکیده
منابع مشابه
Connection between conjunctive capacity and structural properties of graphs
The investigation of the asymptotic behaviour of various graph parameters in powers of a graph is motivated by problems in information theory and extremal combinatorics. Considering various parameters and/or various notions of graph powers we can arrive at different notions of graph capacities, of which the Shannon capacity is best known. Here we study a related notion of the so-called conjunct...
متن کاملStructural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملOn the Conjunctive Capacity of Graphs
The investigation of the asymptotic behaviour of various graph parameters in powers of a fixed graph G = (V,E) is motivated by problems in information theory and extremal combinatorics. Considering various parameters and/or various notions of graph powers we can arrive at different notions of graph capacities, of which the Shannon capacity is best known. Here we study a related notion of the so...
متن کاملstructural properties of fuzzy graphs
matroids are important combinatorial structures and connect close-lywith graphs. matroids and graphs were all generalized to fuzzysetting respectively. this paper tries to study connections betweenfuzzy matroids and fuzzy graphs. for a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. a fuzzy matroid, named graph fuzzy matro...
متن کاملDistances between bicliques and structural properties of bicliques in graphs
A biclique is a maximal bipartite complete induced subgraph of G. The biclique graph of a graph G, denoted by KB(G), is the intersection graph of the family of all bicliques of G. In this work we give a natural definition of the distance between bicliques in a graph. We give a useful formula that relates the distance between bicliques in a graph G and the distance between their respectives vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.04.035